Primitive Element Theorem

Theorem

Let K/F be a finite, separable field extension. Then K/F is a simple extension.

The proof of this theorem is constructive. As such, we will prove the simple case, with two known generator of K, showing exactly how the primitive element can be calculated, and then prove the general result by induction.

Lemma

Let K=F(α,β) be a finite, separable field extension (that is, α and β are algebraic over F with minimal polynomials that have no repeated roots).


Let α1,,αn be the conjugates of α and β1,,βm be the conjugates of β with α=α1 and β=β1.


If cF satisfies

α+cβαi+cβj

for all i{1,,n} and j{2,,m}, then

K=F(α+cβ).
Proof

Let K=F(α,β) be a finite extension and let f and g be the minimal polynomials over F over α and β respectively.

Let α1,,αn be the conjugates of α (the roots of f) and β1,,βm be the conjugates of β (the roots of g) with α=α1 and β=β1.

Now, let c be such that

θ=α+cβαi+cβj

for all i{1,,n} and j{2,,m}.

Such a c exists because there are only finitely many equations, and αi0 and βi0 unless α or β is zero, a trivial case.

Notice that f(α)=0 and therefore f(θcβ)=0. Hence β is a root of f(θcX) and g(X). This is the only common root since g has only roots of the form βk, and if βk is a root of f(θcX) then θcβk=αi (since αi are only roots of f) for some αi, a contradiction unless βk=β.

Therefore f(θcX) and g(X) has a unique common root, β.

Let h be the minimal polynomial of β over F(θ), and consider f(θcX) and g(X) as polynomials in F(θ)[X]. Since the minimal polynomial divides any polynomial with has the same root, we can deduce that

h(X)g(X),f(θcX).

This means that h is linear, since the two polynomials only have one common root and neither have repeated roots because we are working over a separable extension. Since h is monic, we can then conclude that h(X)=Xβ which is in F(θ)[X] and thus βF(θ).

With θcβ=α we have that αF(θ), and hence F(α,β)F(θ). The other inclusion follows simply because θF(α,β).